Design of Gracefully Degradable Hypercube-Connected Systems

نویسندگان

  • Tze Chiang Lee
  • John P. Hayes
چکیده

We address the problem of modifying a hypercube computer by the addition of spare nodes and links to improve its fault tolerance, while maintaining a specified level of performance. The hypercube is modeled by a graph in which nodes represent processors and edges represent communication links. A new graphbased measure of performance degradation is introduced. This characterizes a fault-tolerant hypercube as k-fault-tolerant (L-FT) g-step-degradable (g-SD) if the removal of any k nodes reduces the dimension of the largest fault-free subcube by at most g. We show how to construct k-FT g-SD hypercubes for values of k up to 16 and g = 0, 1, or 2. Many of these designs are shown to be linkor degree-optimal. We also propose a construction method that uses small k-FT g-SD designs as seeds to construct k-IT g-SD designs of larger sizes. This results in fault-tolerant hypercubes in which reconilguration can be first done locally and then easily extended to the entire system. The small number of added links and nodes is shown to be useful not only in increasing the fault tolerance of the underlying hypercube, but also in reducing the average internode distance. Q 1992 Academic Press, Inc.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Gracefully Degradable Pipeline Networks

A pipeline is a linear array of processors with an input node at one end and an output node at the other end. This paper presents k-gracefully-degradable graphs which, given any set of up to k faults, contain a pipeline that uses all the healthy processor nodes. Our constructions are designed to tolerate faulty input and output nodes, but they can be adapted to provide solutions when the input ...

متن کامل

Cycles Embedding Problem in Hierarchical Hypercube Networks

The hierarchical hypercube network is suitable for massively parallel systems. The number of links in the hierarchical hypercube network forms a compromise between those of the hypercube and the cube-connected cycles. Recently, some interesting properties of the hierarchical hypercube network were investigated. Since the hierarchical hypercube is bipartite. A bipartite graph is bipancyclic if i...

متن کامل

Reliability Analysis of a Powerloom Plant Using Interval Valued Intuitionistic Fuzzy Sets

In this paper, we investigate the reliability analysis of a powerloom plant by using interval valued intuitionistic fuzzy sets (IVIFS). Herein, we modeled a powerloom plant as a gracefully degradable system having two units A(n) and B(m) connected in series. The reliability of n components of unit A and m components of unit B is assumed to be an IVIFS defined over the universe of discourse [0, ...

متن کامل

A Highly Fault-Tolerant Circuit-Switched Hypercube

In this paper, we present a strongly fault-tolerant design for a d-dimensional hypercube multiprocessor and examine its reconfigurability. The augmented hypercube has a spare node connected to each node of an i-cube and the spare nodes are also connected as a (d i)-dimensional hypercube. By utilizing the circuit-switched capabilities of the communication modules of the spare nodes, large number...

متن کامل

Hypercube Related Polytopes

Body centered structures are used as seeds for a variety of structures of rank 3 and higher. Propellane based structures are introduced and their design and topological properties are detailed.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • J. Parallel Distrib. Comput.

دوره 14  شماره 

صفحات  -

تاریخ انتشار 1992